Re-seeding invalidates tests of random number generators

نویسندگان

  • Hans Ekkehard Plesser
  • Anders Grønvik Jahnsen
چکیده

Kim et al (Appl Math & Comput 199 (2008) 195) recently presented a test of random number generators based on the gambler’s ruin problem and concluded that several generators, including the widely used Mersenne Twister, have hidden defects. We show here that the test by Kim et al suffers from a subtle, but consequential error: Re-seeding the pseudorandom number generator with a fixed seed for each starting point of the gambler’s ruin process induces a random walk of the test statistic as a function of the starting point. The data presented by Kim et al are thus individual realizations of a random walk and not suited to judge the quality of pseudorandom number generators. When generating or analyzing the Gambler’s ruin data properly, we do not find any evidence for weaknesses of the Mersenne Twister and other widely used random number generators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A revision of the subtract-with-borrow random number generators

The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication – the core of the procedure. This was previo...

متن کامل

On Stochastic Security of Pseudorandom Sequences

Cryptographic primitives such as secure hash functions (e.g., SHA1, SHA2, and SHA3) and symmetric key block ciphers (e.g., AES and TDES) have been commonly used to design pseudorandom generators with counter modes (e.g., in NIST SP800-90A standards). It is assumed that if these primitives are secure then the sequences generated by pseudorandom generators based on these primitives are indistingu...

متن کامل

Random Number Generators and Empirical Tests

We recall some requirements for \good" random number generators and argue that while the construction of generators and the choice of their parameters must be based on theory, a posteriori empirical testing is also important. We then give examples of tests failed by some popular generators and examples of generators passing these tests.

متن کامل

Design of low power random number generators for quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA.  Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...

متن کامل

A Secured Key Generation Scheme Using Enhanced Entropy

This paper is an efficient and secure way to generate true random numbers. With an ever increasing repertoire of applications that incorporate Randomness, there arises a need to ensure that the Randomness is truly Random at all tenable circumstances. Through this paper we formulate a method to generate true random numbers by collecting entropy from devices such as mouse, keyboard and hard disk....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2010